Massively Parallel Analog Computing: Ariadne's Thread Was Made of Memristors

نویسندگان

  • Ioannis Vourkas
  • Dimitrios Stathis
  • Georgios Ch. Sirakoulis
چکیده

This paper explores memristive grids where emergent computation arises through collective device interactions. Computing efficiency of the grids is studied in several scenarios and new composite memristive structures are utilized in shortest path and maze-solving computations. The dependence of the computing medium behavior on the symmetry of both the underlying geometry and the employed devices is validated through SPICE-level circuit simulations, which highlight important computing inefficiencies. Particular circuit-models of memristive connections enable precise mapping of the target application on the computing medium. Extraordinary functionalities emerge when novel memristive computing components, comprising different electrical characteristics from their structural elements, are introduced in the grid. Applying assisted-computation, by incorporating the concept of Ariadne’s thread, leaded to better computing results, which could find application in routing and path computing problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Memristor model for simulating large circuits for massively-parallel analog computing

The model of memristor described in the paper is designed for building models of large networks for analog computations. A circuit containing thousands of memristors for finding the shortest path in a complicated maze is a typical example. The model is designed to meet the following criteria: 1. It is a model of HP memristor with linear dopant drift while respecting the physical bounds of the i...

متن کامل

Solving mazes with memristors: a massively-parallel approach

Solving mazes is not just a fun pastime: They are prototype models in several areas of science and technology. However, when maze complexity increases, their solution becomes cumbersome and very time consuming. Here, we show that a network of memristors--resistors with memory--can solve such a nontrivial problem quite easily. In particular, maze solving by the network of memristors occurs in a ...

متن کامل

Migrant threads on process farms: parallel programming with Ariadne

We present a novel and portable threads-based system for the development of concurrent applications on shared and distributed memory environments. Implementing user-space threads. the Ariadne system is highly effective for medium to coarse grained applications. Sequential programs are readily converted into parallel programs for shared ordistributed memory, with low development effort. We descr...

متن کامل

A Massively Parallel Multithreaded Architecture: DAVRID

MPAs(Massively Parallel Architectures) should address two fundamental issues for scalability: synchronization and communication latency. Dataaow ar-chitectures cause problems of excessive synchronization costs and ineecient execution of sequential programs while they ooer the ability to exploit massive parallelism inherent in programs. In contrast, MPAs based on von Neumann computational model ...

متن کامل

Enhancements of DAVRID for Massively Parallel Processing

Massively Parallel Processing J. H. Kim and S. Y. Han D. J. Hwang Dept. of Computer Science Dept. of Information Engineering Seoul National University, Korea Sungkyunkwan University, Korea E-mail: [email protected] E-mail: [email protected] H. H. Kim S. H. Cho Dept. of Computer Science Dept. of Computer Science Seowon University, Korea Kangnam University, Korea Abstract This pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Emerging Topics Comput.

دوره 6  شماره 

صفحات  -

تاریخ انتشار 2018